Effective Category and Measure in Abstract Complexity Theory (Extended Abstract)
نویسندگان
چکیده
Strong variants of the Operator Speed-up Theorem, Operator Gap Theorem and Compression Theorem are obtained using an effective version of Baire Category Theorem. It is also shown that all complexity classes of recursive predicates have effective measure zero in the space of recursive predicates and, on the other hand, the class of predicates with almost everywhere complexity above an arbitrary recursive threshold has recursive measure one in the class of recursive predicates.
منابع مشابه
Complexity bounds from abstract categorical models
Common category theory notions are useful for abstracting both semantics and programs, simplifying definitions and aiding reasoning. We argue that categorical descriptions can also be used to reason about program complexity. We calculate complexity bounds from the axioms of abstract category theory structures commonly used in programming and semantics, which imply opportunities for optimisation...
متن کاملModelling Algebraic Structures with Prolog Extended Abstract of Full Paper for Cant'95
This paper presents a novel technique of using Prolog with never instantiated variables to manipulate a range of algebraic structures. The paper argues that Prolog is a powerful and underrated tool for use in computational number theory. A detailed example is presented in this extended abstract, and several in the full paper, showing the advantages of using this technique. The detailed example ...
متن کاملSome Quantitative Aspects of Fractional Computability
In this article we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are “fractionally computable” by a partial algorithm. For this purpose it is crucial to specify an allowable effective density, δ, of convergence for a partial algorithm. The set FC(δ) consists of all total functions f : Σ∗ → {0, 1} where Σ is a finite alpha...
متن کاملA History of Selected Topics in Categorical Algebra I: From Galois Theory to Abstract Commutators and Internal Groupoids
This paper is a chronological survey, with no proofs, of a direction in categorical algebra, which is based on categorical Galois theory and involves generalized central extensions, commutators, and internal groupoids in Barr exact Mal’tsev and more general categories. Galois theory proposes a notion of central extension, and motivates the study of internal groupoids, which is then used as an a...
متن کاملExtended Initiality for Typed Abstract Syntax
Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of “models”, yielding induction and recursion principles for abstract syntax. Zsidó [Zsi10, Chap. 6] proves an initiality result for simply–typed syntax: given a signature S, the abstract syntax associated to S constitutes the initial object in a category of models of S in monads. ...
متن کامل